Report On Cobweb Posets' Tiling Problem

نویسنده

  • Maciej Dziemianczuk
چکیده

Responding to Kwaśniewski’s cobweb posets’ problems posed in [3, 4] we present here some results on one of them namely on Cobweb Tiling Problem. Kwaśniewski cobweb posets with tiling property are designated-coded by their correspondent tiling sequences. We show that the family of all cobweb tiling sequences includes Natural numbers, Fibonacci numbers, Gaussian integers and show that there are more other cobweb tiling sequences. We show also that cobweb tiling problem is a particular case of clique problem in a certain graph. To this end we illustrate the area of our reconnaissance by means of the Venn type map of various cobweb sequences families according to definitions from [3, 4].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cobweb posets tiling problem

Kwaśniewski’s cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tili...

متن کامل

Cobweb posets - Recent Results

SUMMARY Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be reported on here. The purpose of this pres...

متن کامل

On Cobweb Posets and Discrete F-Boxes Tilings

Abstract F -boxes defined in [6] as hyper-boxes in N∞ discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F -boxes edges sizes are taken to be values of terms of natural numbers’ valued sequence F . The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F -ti...

متن کامل

Some Cobweb Posets Digraphs’ Elementary Properties and Questions

A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di-bigraphs (directed bi-parted graphs) and their corresponding adjacency matrices is defined and then applied t...

متن کامل

On incidence algebras description of cobweb posets

Abstract The explicite formulas for Möbius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwaśniewski’s construction of his cobweb posets [8, 9]. The digraph representation of these cobweb posets constitutes a newly discovered class of orderable DAG’s [12, 6, 1] named here down KoDAGs with a kind of univers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0802.3473  شماره 

صفحات  -

تاریخ انتشار 2008